Researchers’ online visibility: tensions of visibility, trust and reputation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On material transfer agreements and visibility of researchers in biotechnology

When carrying out a research project, some materials may not be available in-house. Thus, investigators resort to external providers for conducting their research. To that end, the exchange may be formalised through material transfer agreements. In this context, industry, government and academia have their own specific expectations regarding compensation for the help they provide when transferr...

متن کامل

Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition

(a) (b) Figure 8: The nal set of directions from that covers G S in thick gray lines. Two views are provided with (a) presents the regular view of Figures 5 to 7 and (b) shows the entire Gauss map. See also Figure 1. (a) (b) Figure 6: The boundary and central silhouettes of G S in thick dark gray lines is projected onto the plane z = 1 in thick light gray lines, in (a). In (b), The convex hull ...

متن کامل

Tree-visibility Orders Tree-visibility Orders

In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to chordal graphs. This class contains interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an innnite family of minimal for...

متن کامل

Walking in the visibility complex with applications to visibility polygons and dynamic visibility

We first consider the set of faces of the complex representing rays issued from a given object. We define an order on these faces and show, once the visibility complex is computed, how to visit all of them with no additional data structure in optimal time O(kf ), where kf is the number of faces visited. Then we show how to use this walk to perform a topological sweep of the vertices incident to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Online Information Review

سال: 2019

ISSN: 1468-4527

DOI: 10.1108/oir-07-2017-0211